The Queue Inference Engine: Deducing Queue Statistics from Transactional Data
نویسندگان
چکیده
منابع مشابه
Deducing Queueing from Transactional Data: The Queue Inference Engine, Revisited
Larson [1] proposed a method to statistically infer the expected transient queue length during a busy period in 0(n 5) solely from the n starting and stopping times of each customer's service during the busy period and assuming the arrival distribution is Poisson. We develop a new O(n 3) algorithm which uses this data to deduce transient queue lengths as well as the waiting times of each custom...
متن کاملNew directions in queue inference for management implementation
Queue inference is a method of utilizing service-time data, available from ATM's, point-of-sale terminals, and other sources of transactional data, in order to estimate queue parameters. Three basic limitations to the standard method of queue inference are: the statistics generated by the algorithm may not be extensive enough; the running time for the algorithm is too long for large congestion ...
متن کاملAnalysis of Emergency Department Queue System Performance: Simulation Approach Based on Experiment Design
Background: Simulation is an appropriate technique for analyzing and evaluating the dynamic behavior of complex systems. The present study aimed to develop an integrated model using a simulation approach based on designing experiments to analyze performance of the admission queue system of patients, who referred to the emergency department of the Modarres hospital. Methods: In this descriptive...
متن کاملThe Adaptive Priority Queue with Elimination and Combining
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations are based on skiplists, harnessing the potential for parallelism of the add() operations. In addition, methods such as Flat Combining have been proposed to reduce contention, batching together multiple operations to be...
متن کاملA Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009